Concurrent Derivations as Single Pushout Graph Grammar Processes
نویسندگان
چکیده
منابع مشابه
Concurrent derivations as single pushout graph grammar processes
Algebraic graph transformations visually support intuition, have a strong theoretical basis, and provide a formal, implementation independent basis for the description of discretely evolving computational systems and their formal and tractable analysis. Graph grammar models of concurrent systems (petri nets, actor systems) have inspired corresponding semantics developments. Recently this led to...
متن کاملTotal-Single-Pushout Derivations for Internal Graph Attribution
We present a simple, abstract approach that allows to integrate graph attribution into the graph structure itself. We use a declarative setting where the calculation of the attributions relies on single-pushout derivations in a category of total homomorphisms. We discuss applications to term graph typing, including multi-level typing and type classes, and visualisation of compilation.
متن کاملCoreflective Concurrent Semantics for Single-Pushout Graph Grammars
The problem of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets has been faced several times along the years, both for the single-pushout and double-pushout approaches, but only partial results were obtained. In this paper we fully extend Winskel’s approach to single-pushout grammars providing them with a categorical concurrent semantics ...
متن کاملPolymorphic Single-Pushout Graph Transformation
Impressum Forschungsberichte der FHDW Hannover – Veröffentlichungen aus dem Bereich Forschung und Entwicklung der FHDW Hannover. Abstract. The paper extends single-pushout graph transformation by poly-morphism, a key concept in object-oriented design. The notions sub-rule and remainder, well-known in single-pushout rewriting, are applied to model dynamic rule extension and type dependent rule a...
متن کاملAlgebraic Graph Rewriting Using a Single Pushout
We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1995
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80194-x